A New Digital Signature Algorithm Similar to ELGamal Type

نویسندگان

  • Haipeng Chen
  • Xuanjing Shen
  • Yingda Lv
چکیده

Application of digital signature technology becomes more extensive, but many exposed digital signature algorithms have increasingly revealed some shortcomings and deficiencies. Aiming directly at the frequently used digital signature technologies, which are weak to Substitution Attack and Homeostasis Attack, the authors perform the hash transformation on messages before signature. Then, a hash round function is constructed, which simultaneously satisfies the characters of balance, high nonlinearity, strict avalanche criterion and realization of software. Moreover, making use of the hash round function, a new hash algorithm named HRFA (Hash Round Function Algorithm) is contrived. On this basis, aiming at the defect that the existing digital signature algorithms are weak to active attack and impersonation attack, using the hash algorithm named HRFA and the self-certified public key system, a new kind of digital signature algorithm, which is similar to ELGamal, named H-S DSA (Hash Round Function and Self-certified Public Key System Digital Signature Algorithm) is raised and realized. Finally, the authors analyze the H-S DSA from two aspects of security and time-complexity. And, the results show that the new designed digital signature algorithm named H-S DSA not only has better security strength, but also has lower timecomplexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Patch-Based Digital Signature

In this paper a new patch-based digital signature (DS) is proposed. The proposed approach similar to steganography methods hides the secure message in a host image. However, it uses a patch-based key to encode/decode the data like cryptography approaches. Both the host image and key patches are randomly initialized. The proposed approach consists of encoding and decoding algorithms. The encodin...

متن کامل

An Implicit ELGamal Digital Signature Scheme

This paper introduced a detail ElGamal digital signature scheme, and mainly analyzed the existing problems of the ElGamal digital signature scheme. Then improved the scheme according to the existing problems of ElGamal digital signature scheme, and proposed an implicit ElGamal type digital signature scheme with the function of message recovery. As for the problem that message recovery not being...

متن کامل

Conditions on the generator for forging ElGamal signature

This paper describes new conditions on parameters selection that lead to an efficient algorithm for forging ElGamal digital signature. Our work is inspired by Bleichenbacher’s ideas.

متن کامل

Public Key Cryptography with a Group of Unknown Order

We present algorithms for digital signature generation and verification using public key cryptography over an arbitrary group G. The algorithms are similar to those of ElGamal, but do not require a knowledge of the group order. Forging signatures or determining the secret key requires the solution of a discrete logarithm problem over G, or the solution of other problems which appear at least as...

متن کامل

ElGamal Digital Signature Algorithm of Adding a Random Number

As for the problem that ElGamal digital signature scheme’s security is constantly being challenged and increasingly becomes increasingly serious, an improved ElGamal digital signature algorithm is proposed. As the original ElGamal algorithm has its own security disadvantages that only one random number is used, in order to improve its security, the scheme presented in this paper improved this d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010